Low-error two-source extractors for polynomial min-entropy

نویسندگان

  • Avraham Ben-Aroya
  • Dean Doron
  • Amnon Ta-Shma
چکیده

The aim of this paper was to present a new two-source extractor for min-entropy nα for some α < 1 having exponentially-small error. Say we are given two independent sources X and Y . The technique was to condense Y using a somewhere-random condenser to a somewhere-random source with t rows, where one of the rows has a high min-entropy rate. Then, in order to break correlations between the rows, we would use an advice correlation breaker (following the work of [2] and also techniques developed in [3], for example). The advice correlation breaker that we constructed may be of independent interest in case the number of rows is small. Specifically:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simple Extractors via Constructions of Cryptographic Pseudo-random Generators

Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-random generators from one-way permutations (the Blum-Micali-Yao approach) can be used for building extractors as well. Using this new technique we build extractors that do not use designs and polynomial-based error-co...

متن کامل

Error Reduction in Extractors

We present a general method to reduce the error of any extractor. Our method works particularly well in the case that the original extractor extracts up to a constant fraction of the source min-entropy and achieves a polynomially small error. In that case, we are able to reduce the error to (almost) any ε, using only O(log(1/ε)) additional truly random bits (while keeping the other parameters o...

متن کامل

Reusable Fuzzy Extractors for Low-Entropy Distributions

Fuzzy extractors (Dodis et al., Eurocrypt 2004) convert repeated noisy readings of a secret into the same uniformly distributed key. To eliminate noise, they require an initial enrollment phase that takes the first noisy reading of the secret and produces a nonsecret helper string to be used in subsequent readings. Reusable fuzzy extractors (Boyen, CCS 2004) remain secure even when this initial...

متن کامل

Reusable Fuzzy Extractors via Digital Lockers

Fuzzy extractors (Dodis et al., Eurocrypt 2004) convert repeated noisy readings of a secret into the same uniformly distributed key. To eliminate noise, they require an initial enrollment phase that takes the first noisy reading of the secret and produces a nonsecret helper string to be used in subsequent readings. Reusable fuzzy extractors (Boyen, CCS 2004) remain secure even when this initial...

متن کامل

Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic

Let Fq be the field of q elements, where q = p` for prime p. Informally speaking, a polynomial source is a distribution over Fq sampled by low degree multivariate polynomials. In this paper, we construct extractors for polynomial sources over fields of constant size q assuming p q. More generally, suppose a distribution X over Fq has support size qk and is sampled1 by polynomials of individual ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electronic Colloquium on Computational Complexity (ECCC)

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2016